A cutting hyperplane method for solving pseudomonotone non-Lipschitzian equilibrium problems
نویسندگان
چکیده
منابع مشابه
Common solutions to pseudomonotone equilibrium problems
In this paper, we propose two iterative methods for finding a common solution of a finite family of equilibrium problems for pseudomonotone bifunctions. The first is a parallel hybrid extragradient-cutting algorithm which is extended from the previously known one for variational inequalities to equilibrium problems. The second is a new cyclic hybrid extragradient-cutting algorithm....
متن کاملOn Equilibrium Problems Involving Strongly Pseudomonotone Bifunctions
We study equilibrium problems with strongly pseudomonotone bifunctions in real Hilbert spaces. We show the existence of a unique solution. We then propose a generalized strongly convergent projection method for equilibrium problems with strongly pseudomonotone bifunctions. The proposed method uses only one projection without requiring Lipschitz continuity. Application to variational inequalitie...
متن کاملAn analytic center cutting plane method for pseudomonotone variational inequalities
We consider an analytic center algorithm for solving generalized monotone variational inequalities in R", which adapts a recent result due to Goffin et al. (1993) to the numerical resolution of continuous pseudomonotone variational inequalities.
متن کاملcommon solutions to pseudomonotone equilibrium problems
in this paper, we propose two iterative methods for finding a common solution of a finite family of equilibrium problems for pseudomonotone bifunctions. the first is a parallel hybrid extragradient-cutting algorithm which is extended from the previously known one for variational inequalities to equilibrium problems. the second is a new cyclic hybrid extragradient-cutting algorithm....
متن کاملAn Extended Cutting Plane Method for Solving Convex Minlp Problems
An extended version of Kelley’s cutting plane method is introduced in the present paper. The extended method can be applied for the solution of convex MINLP (mixed-integer non-linear programming) problems, while Kelley’s cutting plane method was originally introduced for the solution of convex NLP (non-linear programming) problems only. The method is suitable for solving large convex MINLP prob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2012
ISSN: 1029-242X
DOI: 10.1186/1029-242x-2012-288